package com.vint.mi;

import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;

/**
 * 1.done
 * 2.easy
 * 3.string
 */
public class Mi13 {
    public static String solution(String line){
    	String[] src = line.split(" ");
    	int k = Integer.parseInt(src[1]);
    	String[] arrayStr = src[0].split(",");
    	int[] array = new int[arrayStr.length];
    	for (int i = 0; i < array.length; i++) {
    	    array[i] = Integer.parseInt(arrayStr[i]);
	    }
	    Map<Integer, Integer> app = new HashMap<>();
	    for (int i = 0; i < array.length; i++) {
		    array[i] = Integer.parseInt(arrayStr[i]);
	    }

	    Arrays.sort(array);
	    for (int i = 0; i < array.length; i++) {
	    	if (app.containsKey(array[i])) {
	    	    int val = app.get(array[i]);
	    	    app.put(array[i], val+1);
		    } else {
	    		app.put(array[i], 1);
		    }
	    }

	    return null;
    }
    public static void main(String[] args){
    }
}
